Distance Visibility Algorithm (DiVA) Transition

نویسنده

  • Robert A. Maffione
چکیده

There are three major objectives of this DiVA transition effort: 1) Conduct diver visibility experiments in a range of optical water types to obtain a database for testing and refining the DiVA model; 2) Develop a Monte Carlo model that will be used to perform computer experiments of the DiVA for any combination of water optical properties, environmental conditions, and various types of underwater (incoherent) imaging systems; 3) Provide to the Navy a fully documented DiVA model that can be independently tested and validated; 4) Develop and deliver a real-time, stand-alone computer program for processing in-situ data and providing graphic and numeric output of visibility range.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Single-Point Visibility Constraint Minimum Link Paths in Simple Polygons

We address the following problem: Given a simple polygon $P$ with $n$ vertices and two points $s$ and $t$ inside it, find a minimum link path between them such that a given target point $q$ is visible from at least one point on the path. The method is based on partitioning a portion of $P$ into a number of faces of equal link distance from a source point. This partitioning is essentially a shor...

متن کامل

The Nondeterministic Divide

The noadeterministic divide partitions a vector into two nonempty slices by allowing the point of division to be chosen nondeterministically. Support for high-level divide-and-conquer programming provided by the nondeterministic divide is investigated. A diva algorithm is a recursive divide-andconquer sequential algorithm on one or more vectors of the same range, whose division point for a new ...

متن کامل

Parallel and adaptive visibility sampling for rendering dynamic scenes with spatially varying reflectance

Fast rendering of dynamic scenes with natural illumination, all-frequency shadows and spatially-varying reflections is important but challenging. One main difficulty brought by moving objects is that the runtime visibility update of dynamic occlusion is usually time-consuming and slow. In this paper, we present a new visibility sampling technique and show that efficient all-frequency rendering ...

متن کامل

Investigating Digital Video Applications in Distance Learning

The paper gives a brief overview of the use of digital video in distance education, the background to The Open University’s Digital Video Applications (DiVA) Project, the contexts in which the Digital Video Library system is being used and some evaluation findings. Through DiVA, the university is investigating how it can use its video assets effectively, to support re-use of existing materials ...

متن کامل

Improving The Performance Of Ant Colony Optimisation Algorithms Using Biased Visibility

When used to solve traveling salesperson problems (TSP), Ant Colony Optimisation algorithms use the proximity of two nodes to determine the weight or cost of the edge connecting them. The weights counterpoint the pheromone in the state transition rule, used to determine the desirability of a certain next move. The proximity does not always reflect the desirability of the possible edge correctly...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015